Universal circuit matrix for adjacency graphs of feedback functions
نویسندگان
چکیده
منابع مشابه
Adjacency Matrix Representation in Evolutionary Circuit Synthesis
An analog circuit synthesis method based on evolutionary circuit techniques is proposed where the chromosome in the genetic algorithm is coded through the use of adjacency matrices. The method assumes that the circuit is described at the behavioral level in order to reduce the simulation time. It is shown that adjacency matrices coding of the chromosome reduces considerably the number of anomal...
متن کاملThe adjacency graphs of some feedback shift registers
The adjacency graphs of feedback shift registers (FSRs) with characteristic function of the form g = (x0+x1)∗f are considered in this paper. Some properties about these FSRs are given. It is proved that these FSRs contains only prime cycles and these cycles can be divided into two sets such that each set contains no adjacent cycles. When f is a linear function, more properties about these FSRs ...
متن کاملUniversal graphs and functions on ω1
It is shown to be consistent with various values of b and d that there is a universal graph on ω1. Moreover, it is also shown that it is consistent that there is a universal graph on ω1 — in other words, a universal symmetric function from ω 1 to 2 — but no such function from ω 2 1 to ω. The method used relies on iterating well known reals, such as Miller and Laver reals, and alternating this w...
متن کاملdeterminants of adjacency matrices of graphs
we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...
متن کاملAdjacency posets of planar graphs
In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimension 5. We then show that the dimension of the adjacency poset of an outerplanar graph is at most 5. From below, we show that there is an outerplanar graph whose adjacency poset has dimension 4. We also show that the dim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90294-1